Parallel heuristic search in forward partial-order planning
نویسندگان
چکیده
منابع مشابه
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approaches of UCPOP and VHPOP. In this paper we explore the potential of a forward-chaining state-based search strategy to support partial-order planning in the solution of temporal-numeric problems. Our planner, POPF, is buil...
متن کاملConformant Planning via Heuristic Forward Search
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The plan should be successful regardless of which particular initial state we are in. This paper is motivated by the observation that (1) Conformant planning without conditional effects can be handled easily by any forward ...
متن کاملAnytime heuristic search for partial satisfaction planning
We present a heuristic search approach to solve partial satisfaction planning (PSP) problems. In these problems, goals are modeled as soft constraints with utility values, and actions have costs. Goal utility represents the value of each goal to the user and action cost represents the total resource cost (e.g., time, fuel cost) needed to execute each action. The objective is to find the plan th...
متن کاملContingent Planning via Heuristic Forward Search witn Implicit Belief States
Contingent planning is the task of generating a conditional plan given uncertainty about the initial state and action effects, but with the ability to observe some aspects of the current world state. Contingent planning can be transformed into an And-Or search problem in belief space, the space whose elements are sets of possible worlds. In (Brafman & Hoffmann 2004), we introduced a method for ...
متن کاملContingent Planning via Heuristic Forward Search with Implicit Belief States
Contingent planning is the task of generating a conditional plan given uncertainty about the initial state and action effects, but with the ability to observe some aspects of the current world state. Contingent planning can be transformed into an And-Or search problem in belief space, the space whose elements are sets of possible worlds. In (Brafman & Hoffmann 2004), we introduced a method for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Knowledge Engineering Review
سال: 2016
ISSN: 0269-8889,1469-8005
DOI: 10.1017/s0269888916000230